Traces of randomized distributed algorithms as Gibbs fields Research Report LSV − 02 −

Traces of Randomized Distributed Algorithms As Markov Fields . Application to Rapid Mixing

Observational equivalence and trace equivalence in an extension of Spi − calculus . Application to cryptographic protocols analysis Research Report LSV − 02 − 3 , Mar . 2002 Ecole Normale

Randomized Distributed Configuration Management of Wireless Networks: Multi-layer Markov Random Fields and Near-Optimality

Distributed configuration management is imperative for wireless infrastructureless networks where each node adjusts locally its physical and logical configuration through information exchange with neighbors. Many algorithms have been developed with promising results in this area. However, two issues remain open. The first is the optimality, i.e., whether a distributed algorithm results in a nea...

FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems

These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...

New Attacks on Randomized ECC Algorithms

Elliptic curve cryptography (ECC) has attracted a lot of attention because it can provide similar levels of security with much shorter keys than the arithmetic of multiple-precision integers in finite fields, which has been widely used in many public-key and key-exchange algorithms. Small key sizes are especially important to resource constrained devices as shorter keys require less storage spa...